\hypertarget{binarytree_8h}{}\section{src/tree\+\_\+algorithms/binarytree/binarytree.h File Reference}
\label{binarytree_8h}\index{src/tree\+\_\+algorithms/binarytree/binarytree.\+h@{src/tree\+\_\+algorithms/binarytree/binarytree.\+h}}
{\ttfamily \#include $<$memory$>$}\\*
{\ttfamily \#include $<$functional$>$}\\*
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree}{Introduction\+To\+Algorithm\+::\+Tree\+Algorithm\+::\+Binary\+Tree$<$ Node\+T $>$}
\begin{DoxyCompactList}\small\item\em Binary\+Tree：二叉树，算法导论10章10.4节 \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm}{Introduction\+To\+Algorithm\+::\+Tree\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm}{Tree\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Node\+Type , typename Action\+Type  = std\+::function$<$void (typename Node\+Type\+::\+T)$>$$>$ }\\void \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm_abd9431ca8d1a40f70b6c72c732fc5892}{Introduction\+To\+Algorithm\+::\+Tree\+Algorithm\+::inorder\+\_\+walk} (std\+::shared\+\_\+ptr$<$ Node\+Type $>$ root, Action\+Type action=\mbox{[}$\,$\mbox{]}(typename Node\+Type\+::\+T)\{\})
\begin{DoxyCompactList}\small\item\em inorder\+\_\+walk：二叉树的中序遍历 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Node\+Type , typename Action\+Type  = std\+::function$<$void (typename Node\+Type\+::\+T)$>$$>$ }\\void \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm_a3d57267cd5fea456f6e001dc22d07c85}{Introduction\+To\+Algorithm\+::\+Tree\+Algorithm\+::preorder\+\_\+walk} (std\+::shared\+\_\+ptr$<$ Node\+Type $>$ root, Action\+Type action=\mbox{[}$\,$\mbox{]}(typename Node\+Type\+::\+T)\{\})
\begin{DoxyCompactList}\small\item\em preorder\+\_\+walk：二叉树的前序遍历 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Node\+Type , typename Action\+Type  = std\+::function$<$void (typename Node\+Type\+::\+T)$>$$>$ }\\void \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm_a49b5467191bd51c25ad7e7bfbed51339}{Introduction\+To\+Algorithm\+::\+Tree\+Algorithm\+::postorder\+\_\+walk} (std\+::shared\+\_\+ptr$<$ Node\+Type $>$ root, Action\+Type action=\mbox{[}$\,$\mbox{]}(typename Node\+Type\+::\+T)\{\})
\begin{DoxyCompactList}\small\item\em postorder\+\_\+walk：二叉树的后序遍历 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Node\+Type $>$ }\\void \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm_a96be2938a006ec461c1b0a59d6bee3b5}{Introduction\+To\+Algorithm\+::\+Tree\+Algorithm\+::left\+\_\+rotate} (std\+::shared\+\_\+ptr$<$ Node\+Type $>$ node, std\+::shared\+\_\+ptr$<$ Node\+Type $>$ \&root)
\begin{DoxyCompactList}\small\item\em left\+\_\+rotate：二叉树的左旋转操作 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Node\+Type $>$ }\\void \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm_adeb83a10f8daa65c5cf5921737a04da0}{Introduction\+To\+Algorithm\+::\+Tree\+Algorithm\+::right\+\_\+rotate} (std\+::shared\+\_\+ptr$<$ Node\+Type $>$ node, std\+::shared\+\_\+ptr$<$ Node\+Type $>$ \&root)
\begin{DoxyCompactList}\small\item\em right\+\_\+rotate：二叉树的右旋转操作 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Node\+Type $>$ }\\void \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm_a4fb6d9c7d8b75a8d6ec4ee79fc0b1de5}{Introduction\+To\+Algorithm\+::\+Tree\+Algorithm\+::transplant} (std\+::shared\+\_\+ptr$<$ Node\+Type $>$ node\+\_\+src, std\+::shared\+\_\+ptr$<$ Node\+Type $>$node\+\_\+dst, std\+::shared\+\_\+ptr$<$ Node\+Type $>$ \&root)
\begin{DoxyCompactList}\small\item\em transplant：二叉树的剪切操作 \end{DoxyCompactList}\end{DoxyCompactItemize}
